Turing degree - PDFSEARCH.IO - Document Search Engine

Turing degree
Results: 32

#	Item
11	RESTRICTED JUMP INTERPOLATION IN THE D.C.E. DEGREES Carl G. Jockusch, Jr. and Angsheng Li∗ July 29, 2009 Add to Reading List Source URL: www.math.uiuc.edu Language: English - Date: 2009-07-29 17:56:53 Spectral theory Constructible universe Turing degree Operator theory Ordinary differential equations Orbifold Holomorphic functional calculus Mathematics Mathematical analysis Theoretical computer science
12	ERRATA FOR “ON THE STRENGTH OF RAMSEY’S THEOREM FOR PAIRS” PETER A. CHOLAK, CARL G. JOCKUSCH, JR., AND THEODORE A. SLAMAN Several proofs given in [2] contain significant errors or gaps, although Add to Reading List Source URL: www.math.uiuc.edu Language: English - Date: 2009-08-16 22:19:13 Year of birth missing Turing degree Mathematics Mathematical logic Logic Proof theory Computability theory Carl Jockusch Place of birth missing
13	Questions in Recursion Theory December 1997 This is an informal list of some open problems in recursion theory. Solutions and new questions are welcome, as well as corrections to the attributions given below. Please, sen Add to Reading List Source URL: math.berkeley.edu Language: English - Date: 2002-11-21 07:33:52 Mathematics Recursively enumerable set Turing degree Maximal set Creative and productive sets Simple set Low High Recursive set Computability theory Theoretical computer science Mathematical logic
14	Turing Degrees and Definability of the Jump C Theodore A. Slaman University of California, Berkeley Add to Reading List Source URL: math.berkeley.edu Language: English - Date: 2005-07-21 06:01:25 English people Theory of computation Turing degree Alan Turing Degree of a continuous mapping Computability theory British people Mathematics
15	ENUMERATION 1-GENERICITY IN THE LOCAL ENUMERATION DEGREES. LILIANA BADILLO† , CHARLES M. HARRIS‡ , AND MARIYA I. SOSKOVA§∗ Add to Reading List Source URL: www.fmi.uni-sofia.bg Language: English - Date: 2013-01-04 08:50:43 Forcing Enumeration Mathematical logic Logic Theory of computation Philosophy of mathematics Turing degree Generic programming Mathematics Enumerative combinatorics Computability theory
16	EMBEDDING COUNTABLE PARTIAL ORDERINGS IN THE ENUMERATION DEGREES AND THE ω-ENUMERATION DEGREES Add to Reading List Source URL: www.fmi.uni-sofia.bg Language: English - Date: 2009-11-24 09:48:56 Enumeration Turing degree Constructible universe Ordinal number Series Forcing Mathematics Mathematical logic Enumerative combinatorics
17	DEFINABILITY VIA KALIMULLIN PAIRS IN THE STRUCTURE OF THE ENUMERATION DEGREES HRISTO A. GANCHEV† AND MARIYA I. SOSKOVA†‡ Add to Reading List Source URL: www.fmi.uni-sofia.bg Language: English - Date: 2013-01-04 08:54:41 Turing degree Recursively enumerable set Turing reduction Reduction Structure Order Computability theory Mathematics Enumeration
18	THE AUTOMORPHISM GROUP OF THE ENUMERATION DEGREES MARIYA I. SOSKOVA† Add to Reading List Source URL: www.fmi.uni-sofia.bg Language: English - Date: 2013-11-11 20:26:54 Philosophy of mathematics Turing degree Turing jump Enumeration Theodore Slaman Arithmetical set Computability theory Mathematics Logic
19	The Local Structure of the Enumeration Degrees Add to Reading List Source URL: www.fmi.uni-sofia.bg Language: English - Date: 2008-07-19 09:57:30 Enumerative combinatorics Mathematical logic Enumeration Recursively enumerable set Degree Turing degree Mathematics Computability theory Theory of computation
20	The Turing universe in the context of enumeration reducibility Mariya I. Soskova Sofia University and University of California, Berkeley A fundamental goal of computability theory is to understand the way that Add to Reading List Source URL: www.fmi.uni-sofia.bg Language: English - Date: 2013-11-11 20:32:42 Mathematics Turing degree Turing reduction Turing jump Enumeration Low Recursively enumerable set Arithmetical hierarchy Halting problem Computability theory Theoretical computer science Mathematical logic